Critical Constants for Recurrence on Groups of Polynomial Growth

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Critical constants for recurrence on groups of polynomial growth

The critical constant for recurrence, cr t , is an invariant of the quotient space H\G of a finitely generated group. The constant is determined by the largest moment a probability measure on G can have without the induced random walk on H\G being recurrent. We present a description of which subgroups of groups of polynomial volume growth are recurrent. Using this we show that for such recurren...

متن کامل

On Groups whose Geodesic Growth is Polynomial

This note records some observations concerning geodesic growth functions. If a nilpotent group is not virtually cyclic then it has exponential geodesic growth with respect to all finite generating sets. On the other hand, if a finitely generated group G has an element whose normal closure is abelian and of finite index, then G has a finite generating set with respect to which the geodesic growt...

متن کامل

Topological multiple recurrence for polynomial configurations in nilpotent groups

We establish a general multiple recurrence theorem for an action of a nilpotent group by homeomorphisms of a compact space. This theorem can be viewed as a nilpotent version of our recent polynomial Hales-Jewett theorem ([BL2]) and contains nilpotent extensions of many known “abelian” results as special cases. 0. Introduction 0.1. The celebrated van der Waerden theorem on arithmetic progression...

متن کامل

Note on Polynomial Recurrence

Let (X,B, μ, T ) be a measure-preserving system. The well-known Poincare recurrence theorem asserts for any A ∈ B with μ(A) > 0, there exist infinitely many n ∈ N such that μ(A ∩ TA) > 0. For a subset S of N, we say S is syndetic if there exists a constant C > 0 such that S ∩ [x, x + C] 6= ∅ for any sufficiently large x, i.e., S has bound gaps. In [5], Khintchine proved that for any A ∈ B with ...

متن کامل

On the Degree of Groups of Polynomial Subgroup Growth

Let G be a finitely generated residually finite group and let an(G) denote the number of index n subgroups of G. If an(G) ≤ nα for some α and for all n, then G is said to have polynomial subgroup growth (PSG, for short). The degree of G is then defined by deg(G) = limsup log an(G) log n . Very little seems to be known about the relation between deg(G) and the algebraic structure of G. We derive...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Probability

سال: 2010

ISSN: 1083-6489

DOI: 10.1214/ejp.v15-773